Colloquium: Can entropy save bacteria?

نویسنده

  • Suckjoon Jun
چکیده

This article presents a physical biology approach to understanding organization and segregation of bacterial chromosomes. The author uses a “piston” analogy for bacterial chromosomes in a cell, which leads to a phase diagram for the organization of two athermal chains confined in a closed geometry characterized by two length scales (length and width). When applied to rod-shaped bacteria such as Escherichia coli, this phase diagram predicts that, despite strong confinement, duplicated chromosomes will demix, ı.e., there exists a primordial physical driving force for chromosome segregation. The author discusses segregation of duplicating chromosomes using the concentric-shell model, which predicts that newly synthesized DNA will be found in the periphery of the chromosome during replication. In contrast to chromosomes, these results suggest that most plasmids will be randomly distributed inside the cell because of their small sizes. An active partitioning system is therefore required for accurate segregation of low-copy number plasmids. Implications of these results are also sketched, e.g., on the role of proteins, segregation mechanisms for bacteria of diverse shapes, cell cycle of an artificial cell, and evolution.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two-Source Extractors for Quasi-Logarithmic Min-Entropy and Improved Privacy Amplification Protocols

This paper offers the following contributions: • We construct a two-source extractor for quasi-logarithmic min-entropy. That is, an extractor for two independent n-bit sources with min-entropy Õ(log n). Our construction is optimal up to poly(log log n) factors and improves upon a recent result by Ben-Aroya, Doron, and Ta-Shma (ECCC’16) that can handle min-entropy log n · 2 √ log . • A central p...

متن کامل

Extractors for a Constant Number of Polynomial Min-Entropy Independent Sources

We consider the problem of bit extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, each of which have minentropy n for an arbitrarily small constant γ > 0. Our constructions are different from recent extractor constructions [BIW04, BKS05, Raz05, Bou05] for this problem in the sense that they do not rely on an...

متن کامل

Entropy of operators or why matrix multiplication is hard for small depth circuits

We consider unbounded fanin depth-2 circuits with arbitrary boolean functions as gates. The entropy of an operator f : {0, 1}n → {0, 1}m is defined as the logarithm of the maximum number of vectors distinguishable by at least one special subfunction of f . We prove that every depth-2 circuit for f requires at least entropy(f) wires. This generalizes and substantially simplifies the argument use...

متن کامل

Low-error two-source extractors for polynomial min-entropy

The aim of this paper was to present a new two-source extractor for min-entropy nα for some α < 1 having exponentially-small error. Say we are given two independent sources X and Y . The technique was to condense Y using a somewhere-random condenser to a somewhere-random source with t rows, where one of the rows has a high min-entropy rate. Then, in order to break correlations between the rows,...

متن کامل

Extractors for Affine Sources with Polylogarithmic Entropy

We give the first explicit construction of deterministic extractors for affine sources over F2, with entropy k ≥ log n for some large enough constant C, where n is the length of the source. Previously the best known results are by Bourgain [Bou07], Yehudayoff [Yeh11] and Li [Li11b], which require the affine source to have entropy at least Ω(n/ √ log log n). Our extractor outputs one bit with er...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008